Implementing Constraint Retraction for Finite Domains

نویسندگان

  • Yan Georget
  • Philippe Codognet
  • Francesca Rossi
چکیده

Constraint retraction, while being certainly a very convenient feature in many situations, is usually not provided in current constraint programming environments. In this paper we describe how constraint retraction can be incorporated in the FD constraint solver and we evaluate its behavior within the clp(FD) system. Experimental results on usual benchmarks and also on classes of problems of increasing connectivity show that in almost all cases the use of our retraction algorithm provides great speed-up with respect to standard methods while not slowing down the clp(FD) system when no retraction is performed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VARIATIONAL DISCRETIZATION AND MIXED METHODS FOR SEMILINEAR PARABOLIC OPTIMAL CONTROL PROBLEMS WITH INTEGRAL CONSTRAINT

The aim of this work is to investigate the variational discretization and mixed finite element methods for optimal control problem governed by semi linear parabolic equations with integral constraint. The state and co-state are approximated by the lowest order Raviart-Thomas mixed finite element spaces and the control is not discreted. Optimal error estimates in L2 are established for the state...

متن کامل

Correctness of Constraint Retraction Algorithms

In this paper, we present a general scheme for incremental constraint retraction algorithms that encompasses all existing algorithms. Moreover, we introduce some necessary conditions to ensure the correctness of any new incremental constraint retraction algorithms. This rather theoretical work is based on the notion of explanation for constraint programming and is exemplified within the PALM sy...

متن کامل

Constraint Solving on Lattices

We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constraint similar to the indexicals used by CLP over finite domains and on a particular definition of an interval lattice built from the computation domain. We provide the theoretical foundations for this framework, a schemati...

متن کامل

Implementing Constraint Relaxation over Finite Domains Using Assumption-Based Truth Maintenance Systems

Many real-life Constraint Satisfaction Problems are overconstrained. In order to provide some kind of solution for such problems, this paper proposes a constraint relaxation mechanism fully integrated with the constraint solver. Such a constraint relaxation system must be able to perform two fundamental tasks: identi cation of constraints to relax and e cient constraint suppression. Assumption-...

متن کامل

Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains

Consistency techniques proved to be an efficient method for reducing the search space of CSP. Several consistency techniques were proposed for soft constraint frameworks too. In this paper, we propose a full arc consistency (FAC) for weighted CSP (WCSP) and an algorithm for enforcing FAC and maintaining it during Branch & Bound search. We also define the transformation of constraint hierarchies...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997